An Efficient Variable-Length Tap FIR Filter Chip

نویسندگان

  • Sung Hyun Yoon
  • Myung Hoon Sunwoo
چکیده

Abstract This paper proposes a novel VLSI architecture for an FIR filter chip providing variable-length taps. To change the number of taps, we propose two special features called a data-reuse structure and a recurrent-coefficient scheme. These features consist of several MUXs and registers and reduce the number of gates over 20 % compared with existing chips using an address generation unit and a modulo unit. Since parallel multipliers occupy a large VLSI area, a filter chip using bitserial multipliers meeting the real-time requirement specification can dramatically save the area. We propose a modified bit-serial multiplication algorithm to compute two partial products in parallel, and thus, the proposed filter can be twice faster than previous filters using bit-serial multipliers. We developed VHDL models and performed logic synthesis using the SYNOPSYSTM CAD tool with the 0.8 μm SOG cell library (HSG30042). The chip has only 9,507 gates, was fabricated, and is running at 77 MHz.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA-based FIR Filter Using Bit-Serial Digital Signal Processing Application Note

This application note describes the implementation of an FIR (Finite-Impulse Response) Filter with variable coefficients that fits in a single AT6002 FPGA. The filter uses a bit-serial arithmetic approach to the digital signal processing and is based upon the Atmel AT6000 series FPGAs. This note discusses the bit-serial arithmetic used for compact and efficient implementation of real-time DSP a...

متن کامل

Efficient Complexity Reduction Technique for Parallel FIR Digital Filter based on Fast FIR Algorithm

The objective of the paper is to reduce the hardware complexity of higher order FIR filter with symmetric coefficients. The aim is to design an efficient Fast Finite-Impulse Response (FIR) Algorithms (FFAs) for parallel FIR filter structure, with a constrain that the filter tap must be multiple of 2. In our work we have briefly discussed for L=4 parallel implementation. The parallel FIR filter ...

متن کامل

Low-power and area-efficient FIR filter implementation suitable for multiple taps

This paper describes a 32-tap finite impulse response (FIR) filter with two 16-tap macros suitable for multiple taps. The derived condition for a coded coefficient and data block shows 35% savings in power consumption and 44% improvement in occupied area compared to a typical radix-4 modified Booth algorithm. According to the condition and separated shifting-accessing clock scheme, we have impl...

متن کامل

A Novel Fast FIR Algorithm for Area-Efficient Parallel FIR Digital Filter Structures Utilizes Symmetric Convolutions

Based on fast finite-impulse response (FIR) algorithms (FFAs), this paper proposes new parallel FIR filter structures, which are beneficial to symmetric coefficients in terms of the hardware cost, under the condition that the number of taps is a multiple of 2 or 3. The proposed parallel FIR structures exploit the inherent nature of symmetric coefficients reducing half the number of multipliers ...

متن کامل

Memory Efficient Architecture For High Speed Fir Filter Using Distributed Arithmetic

This paper presents the realization of memory efficient architecture using Distributed Arithmetic (DA) for implementation of Finite Impulse Response (FIR) filter. Here, the multipliers in FIR filter are replaced with multiplier less DA based technique. First, the theory of DA is described. In this technique, pre-computed values of inner product are stored in LUT, which are further added and shi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998